1945F - Kirill and Mushrooms - CodeForces Solution


data structures sortings *1900

Please click on ads to support us..

Python Code:

from heapq import heappop, heappush
 
for _ in range(int(input())):
    x=int(input())
    a=list(map(int, input().split()))
    b=list(map(int, input().split()))
    h=[]
    ans=0
    p=-1
    for i in range(x-1,-1,-1):
        heappush(h,a[b[i]-1])
        while len(h)>i+1:
            heappop(h)
        r=h[0]*len(h)
        if r>=ans:
            ans=r
            p=i+1
    print(ans,p)


Comments

Submit
0 Comments
More Questions

832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array